Two-Level Convex Relaxed Variational Model for Multiplicative Denoising
نویسندگان
چکیده
The fully developed speckle (multiplicative noise) naturally appears in coherent imaging systems, such as synthetic aperture radar. Since the speckle is multiplicative, it is difficult to interpret observed data. Total variation (TV) based variational models have recently been used in the removal of the speckle because of the strong edge preserving property of TV and reasonable computational cost. However, the fidelity term (or negative log-likelihood) of the original variational model [G. Aubert and J.-F. Aujol, SIAM J. Appl. Math., 68 (2008), pp. 925–946], which appears on maximum a posteriori (MAP) estimation, is not convex. Recently, the logarithmic transformation and the mth root transformation have been proposed to relax the nonconvexity. It is empirically observed that the mth root transform based variational model outperforms the log transform based variational model. However, the performance of the mth root transform based model critically depends on the choice of m. In this paper, we propose the two-level convex relaxed variational model; i.e., we relax the original variational model by using the mth root transformation and the concave conjugate. We also adapt the two-block nonlinear Gauss–Seidel method to solve the proposed model. The performance of the proposed model does not depend on the choice of m, and the model shows overall better performance than the logarithmic transformed variational model and the mth root transformed variational model.
منابع مشابه
A Convex Variational Model for Restoring Blurred Images with Multiplicative Noise
In this paper, a new variational model for restoring blurred images with multiplicative noise is proposed. Based on the statistical property of the noise, a quadratic penalty function technique is utilized in order to obtain a strictly convex model under a mild condition, which guarantees the uniqueness of the solution and the stabilization of the algorithm. For solving the new convex variation...
متن کاملA Weberized Total Variation Regularization-Based Image Multiplicative Noise Removal Algorithm
Multiplicative noise removal is of momentous significance in coherent imaging systems and various image processing applications. This paper proposes a new nonconvex variational model for multiplicative noise removal under the Weberized total variation (TV) regularization framework. Then, we propose and investigate another surrogate strictly convex objective function for Weberized TV regularizat...
متن کاملComments on relaxed $(gamma, r)$-cocoercive mappings
We show that the variational inequality $VI(C,A)$ has aunique solution for a relaxed $(gamma , r)$-cocoercive,$mu$-Lipschitzian mapping $A: Cto H$ with $r>gamma mu^2$, where$C$ is a nonempty closed convex subset of a Hilbert space $H$. Fromthis result, it can be derived that, for example, the recentalgorithms given in the references of this paper, despite theirbecoming more complicated, are not...
متن کاملA Relaxed Extra Gradient Approximation Method of Two Inverse-Strongly Monotone Mappings for a General System of Variational Inequalities, Fixed Point and Equilibrium Problems
متن کامل
Stationary Noise : Model and Parameter Selection in Variational Methods
Additive or multiplicative stationary noise recently became an important issue in applied fields such as microscopy or satellite imaging. Relatively few works address the design of dedicated denoising methods compared to the usual white noise setting. We recently proposed a variational algorithm to tackle this issue. In this paper, we analyze this problem from a statistical point of view and pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Imaging Sciences
دوره 6 شماره
صفحات -
تاریخ انتشار 2013